Impact of Intel's New Instruction Sets on Software Implementation of GF(2)[x] Multiplication
نویسندگان
چکیده
PCLMULQDQ, a new instruction that supports GF(2)[x] multiplication, was introduced by Intel in 2010. This instruction brings dramatic change to software implementation of multiplication in GF(2m) fields. In this paper, we present improved Karatsuba formulae for multiplying two small binary polynomials, compare different strategies for PCLMULQDQbased multiplication in the five GF(2m) fields recommended by NIST and conclude the best design approaches to software implementation of GF(2)[x] multiplication.
منابع مشابه
Fast Software Exponentiation in GF(2^k)
We present a new algorithm for computing a e where a 2 GF2 k and e is a positive integer. The proposed algorithm is more suitable for implementation in software , and relies on the Montgomery multiplication in GF2 k. The speed of the exponentiation algorithm largely depends on the availability of a fast method for multiplying two polynomials of length w deened over GF2. The theoretical analysis...
متن کاملInstruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2m)
The performance of elliptic curve (EC) cryptosystems depends essentially on efficient arithmetic in the underlying finite field. Binary finite fields GF(2m) have the advantage of “carry-free” addition. Multiplication, on the other hand, is rather costly since polynomial arithmetic is not supported by general-purpose processors. In this paper we propose a combined hardware/software approach to o...
متن کاملAn Algorithm for Inversion in GF(2) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
An algorithm for inversion in GF(2) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid’s algorithm. In the algorithm, operations corresponding to several contiguous iterations of the VLSI algorithm proposed by Brunner et al. is represented as a matrix. They are calculated at once through the matrix efficiently by means of...
متن کاملInstruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2)
Instruction set extensions are a small number of custom instructions specifically designed to accelerate the processing of a given kind of workload such as multimedia or cryptography. Enhancing a general-purpose RISC processor with a few application-specific instructions to facilitate the inner loop operations of public-key cryptosystems can result in a significant performance gain. In this pap...
متن کاملInstruction Set Extensions for Fast Arithmetic in Finite Fields GF( p) and GF(2m)
Instruction set extensions are a small number of custom instructions specifically designed to accelerate the processing of a given kind of workload such as multimedia or cryptography. Enhancing a general-purpose RISC processor with a few application-specific instructions to facilitate the inner loop operations of public-key cryptosystems can result in a significant performance gain. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2011